Timing Analysis with Implicitly Specified False Paths
نویسندگان
چکیده
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each node one has to store the number of delays which is proportional to that of false paths going through the node. We propose a reduction technique that allows one to drastically reduce the number of delays to store. In particular, the technique can be applied when false paths are implicitly specified by a set of through-path exceptions or false sub-graphs. In addition, we introduce a new data structure for representing false paths called abstract false graphs which are as expressive as false subgraphs but are as compact as through-path exceptions. A preliminary prototype implementation illustrates the potential benefits of our reduction technique by showing up to exponential reduction in memory usage and run-time over previous work.
منابع مشابه
Removing False Paths from Combinational Modules
The existence of false paths complicates the task of accurate timing analysis significantly. A technique to remove false paths from a combinational circuit without degrading its performance has a practical value since topological timing analysis is then good enough to estimate the performance of false-path-free circuits accurately. One can think of the KMS algorithm [1] as such a procedure. It ...
متن کاملDelay Characterization of Combinational Modules1
We address three related issues on timing characterization of combinational modules. We first introduce a new notion called timing safe-replaceability as a way of comparing the timing characteristics of two combinational modules formally. This notion allows us to determine whether a new module is a safe replacement of an original module in terms of timing under any surrounding environment. Seco...
متن کاملFalse Path Analysis in Sequential Circuits
We propose a formulation of the sensitization constraints that must be satisfied by all true paths in a sequential circuit and suggest a number of approximations to these constraints aimed at simplifying their computation while capturing their essential dependencies. Using one of these approximations we show how an existing combinational timing analysis tool, can be easily augmented to identify...
متن کاملHierarchical Timing Analysis under the XBD0 Model
We propose a hierarchical timing analysis technique applicable to the XBD0 delay model, which is the underlying model for floating mode analysis and viability analysis. Given a hierarchical combinational circuit, the timing property of each leaf module is characterized first. Since this timing characterization step takes into account false paths in each module, a timing model constructed is mor...
متن کاملMethods of Critical Paths Delay Faults Testing in Digital Systems
The dissertation thesis is aimed at automatic delay faults test generation methods for digital systems. Path delay faults are tested via selected critical paths in a tested digital circuit. The critical paths can be specified e.g. by static timing analysis (STA), statistical static timing analysis (SSTA) and others. Signal delay propagation is also affected by many factors such as power supply ...
متن کامل